MATH 323 DISCRETE MATHEMATICS, Handout 2 Mathematical proof, especially proof by induction
نویسنده
چکیده
In this handout, we discuss two fundamental techniques of mathematical argument which will be used frequently in the course: proof by contradiction, which is fairly straightforward, and proof by mathematical induction, which is a little more subtle. We give some illustrative applications to graph theory. We shall also give an appendix concerning some subtleties behind the notion of mathematical induction. I suggest that you learn the proofs of the theorems, because the proofs can sometimes be adapted to solve problems which the theorems do not cover. Besides, I shall sometimes ask for proofs of the theorems in the exams. Please let me know of your corrections to these notes.
منابع مشابه
4-critical Graphs on Surfaces without Contractible (<=4)-cycles
We show that if G is a 4-critical graph embedded in a fixed surface Σ so that every contractible cycle has length at least 5, then G can be expressed as G = G′ ∪ G1 ∪ G2 ∪ . . . ∪ Gk, where |V (G′)| and k are bounded by a constant (depending linearly on the genus of Σ) and G1, . . . , Gk are graphs (of unbounded size) whose structure we describe exactly. The proof is computer-assisted—we use co...
متن کاملTeaching Induction with Functional Programming and A Proof Assistant
Mathematical induction is a difficult subject for beginning students of computer science to fully grasp. In this short paper, we propose using functional programming and proof assistants as an aide in teaching mathematical induction in a traditional discrete mathematics course. To demonstrate this approach, we created a proof-ofconcept web-based tutorial on induction. In this tutorial, students...
متن کاملReading 5 : Induction
In the last reading we began discussing proofs. We mentioned some proof paradigms that are generally applicable. For implications, we saw how to write a direct proof and an indirect proof. We saw how to prove equivalences by proving two implications and by constructing a chain of equivalences. We also saw two techniques applicable to proofs of any statements, namely proof by contradiction and p...
متن کاملA bijective proof of Cassini's Fibonacci identity
can be easily proved by either induction, Binet's formula, or ([1, p. 80]) by taking determinants in In this paper we give a bijective proof, based upon the following combinatorial interpretation of the Fibonacci numbers. Proof of (1). Let e = (2,..., 2); define the bijection ~r: A(n)×A(n)\(e, e)-~ A(n-1) ×A(n + 1)\(e,e) as follows. Let [bs)]eA(n) × A(n) and look for the first 1 in Case I. The ...
متن کاملSome specific concepts and tools of Discrete Mathematics
Discrete Mathematics deals with finite or countable sets, and thus, in particular, with natural numbers. This mathematical field bring into play several overlapping domains, e.g. number theory (arithmetic and combinatorics), graph theory, and combinatorial geometry. As a consequence of the peculiarities of discreteness versus continuum, interesting specific reasonings can be developed (Batanero...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009